Poisson Approximation in a Poisson Limit Theorem Inspired by Coupon Collecting
نویسندگان
چکیده
منابع مشابه
Poisson Approximation in a Poisson Limit Theorem Inspired by Coupon Collecting
In this paper we refine a Poisson limit theorem of Gnedenko and Kolmogorov (1954): we determine the error order of a Poisson approximation for sums of asymptotically negligible integer-valued random variables that converge in distribution to the Poisson law. As an application of our results, we investigate the case of the coupon collector’s problem when the distribution of the collector’s waiti...
متن کاملThe central limit theorem and Poisson approximation
2 Poisson approximation 6 2.1 A coupling approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Stein’s method for Poisson approximation . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Independent summands . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.2 Dependent summands: the local approach . . . . . . . . . . . . . . . . . 10 2.2.3 Size biasing and coup...
متن کاملA Poisson Limit Theorem for Toral Automorphisms
We introduce a new method of proving Poisson limit laws in the theory of dynamical systems, which is based on the Chen-Stein method (7, 20]) combined with the analysis of the homoclinic Laplace operator in 11] and some other ho-moclinic considerations. This is accomplished for hyperbolic toral automorphism T and the normalized Haar measure P. Let (G n) n0 be a sequence of measurable sets with n...
متن کاملA hooray for Poisson approximation
We give several examples for Poisson approximation of quantities of interest in the analysis of algorithms: the distribution of node depth in a binary search tree, the distribution of the number of losers in an election algorithm and the discounted profile of a binary search tree. A simple and well-known upper bound for the total variation distance between the distribution of a sum of independe...
متن کاملA Compound Poisson Approximation Inequality
We give conditions under which the number of events which occur in a sequence of m-dependent events is stochastically smaller than a suitably defined compound Poisson random variable. The results are applied to counts of sequence pattern appearances and to system reliability. We also provide a numerical example.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2009
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1245676108